Nonlinear complementarity as unconstrained and constrained minimization
نویسندگان
چکیده
منابع مشابه
Nonlinear complementarity as unconstrained and constrained minimization
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtained from an augmented Lagrangian formulation. The dimensionality of the unconstrained problem is the same as that of the original problem, and the penalty parameter need only be greater than one. Another feature of the unconstrained problem is that it has global minima of zero at precisely all th...
متن کاملAn Unconstrained Optimization Technique for Nonsmooth Nonlinear Complementarity Problems
In this article, we consider an unconstrained minimization formulation of the nonlinear complementarity problem NCP(f) when the underlying functions are H-differentiable but not necessarily locally Lipschitzian or directionally differentiable. We show how, under appropriate regularity conditions on an H-differential of f , minimizing the merit function corresponding to f leads to a solution of ...
متن کاملAlternating Minimization as Sequential Unconstrained Minimization: A Survey
Sequential unconstrained minimization is a general iterative method for minimizing a function over a given set. At each step of the iteration we minimize the sum of the objective function and an auxiliary function. The aim is to select the auxiliary functions so that, at least, we get convergence in function value to the constrained minimum. The SUMMA is a broad class of these methods for which...
متن کاملStationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems
We consider two merit functions which can be used for solving the nonlinear complementarity problem via nonnegatively constrained minimization. One of the functions is the restricted implicit Lagrangian (Refs. 1-3), and the other appears to be new. We study the conditions under which a stationary point of the minimization problem is guaranteed to be a solution of the underlying complementarity ...
متن کاملIterative Reweighted Minimization Methods for $l_p$ Regularized Unconstrained Nonlinear Programming
In this paper we study general lp regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of the firstand second-order stationary points and hence also of local minimizers of the lp minimization problems. We extend some existing iterative reweighted l1 (IRL1) and l2 (IRL2) minimization methods to solve these problems and propose new variants fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1993
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01585171